Distributed average consensus with least-mean-square deviation
نویسندگان
چکیده
منابع مشابه
Distributed average consensus with least-mean-square deviation
We consider a stochastic model for distributed average consensus, which arises in applications such as load balancing for parallel processors, distributed coordination of mobile autonomous agents, and network synchronization. In this model, each node updates its local variable with a weighted average of its neighbors’ values, and each new value is corrupted by an additive noise with zero mean. ...
متن کاملConsensus-Based Distributed Least-Mean Square Algorithm Using Wireless Ad Hoc Networks
We deal with online estimation and tracking of (non)stationary signals using ad hoc wireless sensor networks (WSNs). A fully distributed least-mean square (D-LMS) type of algorithm is presented, which offers simplicity and flexibility whilst solely requiring single-hop communications among sensors. The algorithm entails the minimization of a pertinent cost function by resorting to: (i) the alte...
متن کاملDistributed Incremental Least Mean-Square for Parameter Estimation using Heterogeneous Adaptive Networks in Unreliable Measurements
Adaptive networks include a set of nodes with adaptation and learning abilities for modeling various types of self-organized and complex activities encountered in the real world. This paper presents the effect of heterogeneously distributed incremental LMS algorithm with ideal links on the quality of unknown parameter estimation. In heterogeneous adaptive networks, a fraction of the nodes, defi...
متن کاملLeast Mean Square Algorithm
The Least Mean Square (LMS) algorithm, introduced by Widrow and Hoff in 1959 [12] is an adaptive algorithm, which uses a gradient-based method of steepest decent [10]. LMS algorithm uses the estimates of the gradient vector from the available data. LMS incorporates an iterative procedure that makes successive corrections to the weight vector in the direction of the negative of the gradient vect...
متن کاملLeast Mean Square Algorithm
The Least Mean Square (LMS) algorithm, introduced by Widrow and Hoff in 1959 [12] is an adaptive algorithm, which uses a gradient-based method of steepest decent [10]. LMS algorithm uses the estimates of the gradient vector from the available data. LMS incorporates an iterative procedure that makes successive corrections to the weight vector in the direction of the negative of the gradient vect...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Parallel and Distributed Computing
سال: 2007
ISSN: 0743-7315
DOI: 10.1016/j.jpdc.2006.08.010